The Rahman Polynomials Are Bispectral

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Rahman Polynomials Are Bispectral

In a very recent paper, M. Rahman introduced a remarkable family of polynomials in two variables as the eigenfunctions of the transition matrix for a nontrivial Markov chain due to M. Hoare and M. Rahman. I indicate here that these polynomials are bispectral. This should be just one of the many remarkable properties enjoyed by these polynomials. For several challenges, including finding a gener...

متن کامل

Constructing bispectral dual Hahn polynomials

Using the concept ofD-operator and the classical discrete family of dual Hahn, we construct orthogonal polynomials (qn)n which are also eigenfunctions of higher order difference operators. c ⃝ 2014 Elsevier Inc. All rights reserved. MSC: 33C45; 33E30; 42C05

متن کامل

Kp Solitons Are Bispectral

It is by now well known that the wave functions of rational solutions to the KP hierarchy which can be achieved as limits of the pure nsoliton solutions satisfy an eigenvalue equation for ordinary differential operators in the spectral parameter. This property is known as “bispectrality” and has proved to be both interesting and useful. In a recent preprint (mathph/9806001) evidence was present...

متن کامل

Bispectral Commuting Difference Operators for Multivariable Askey-wilson Polynomials

We construct a commutative algebra Az , generated by d algebraically independent q-difference operators acting on variables z1, z2, . . . , zd, which is diagonalized by the multivariable Askey-Wilson polynomials Pn(z) considered by Gasper and Rahman [6]. Iterating Sears’ 4φ3 transformation formula, we show that the polynomials Pn(z) possess a certain duality between z and n. Analytic continuati...

متن کامل

Some Families of Graphs whose Domination Polynomials are Unimodal

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry, Integrability and Geometry: Methods and Applications

سال: 2007

ISSN: 1815-0659

DOI: 10.3842/sigma.2007.065